On Numerical 2D P Colonies Modelling the Grey Wolf Optimization Algorithm
نویسندگان
چکیده
The 2D P colonies is a version of the with two-dimensional environment designed for observing behavior community very simple agents living in shared environment. Each agent equipped set programs consisting small number rules. These allow to act and move have been shown be suitable simulations various (not only) multi-agent systems, natural phenomena, like flash floods. Grey wolf algorithm optimization-based inspired by social dynamics found packs grey wolves their ability create hierarchies, which every member has clearly defined role, dynamically. In our previous papers, we extended colony universal communication device, blackboard. blackboard allows share information, e.g., position or information about surroundings. this paper, follow research on numerical We present computer simulator results simulation, compare these original algorithm.
منابع مشابه
A Novel Complex-Valued Encoding Grey Wolf Optimization Algorithm
Grey wolf optimization (GWO) is one of the recently proposed heuristic algorithms imitating the leadership hierarchy and hunting mechanism of grey wolves in nature. The aim of these algorithms is to perform global optimization. This paper presents a modified GWO algorithm based on complex-valued encoding; namely the complex-valued encoding grey wolf optimization (CGWO). We use CGWO to test 16 u...
متن کاملStructural Damage Assessment Via Model Updating Using Augmented Grey Wolf Optimization Algorithm (AGWO)
Some civil engineering-based infrastructures are planned for the Structural Health Monitoring (SHM) system based on their importance. Identifiction and detecting damage automatically at the right time are one of the major objectives this system faces. One of the methods to meet this objective is model updating whit use of optimization algorithms in structures.This paper is aimed to evaluate the...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولGrey Wolf Algorithm for Software Organization
Nature has always been a source of inspiration for solving complex engineering problems. It could be easily observed in the latest optimization algorithms that have been inspired by nature. Grey Wolf Optimization algorithm is a recent optimization algorithm that has been inspired by hunting behavior of grey wolves. In this paper, this algorithm has been investigated for the process of software ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Processes
سال: 2021
ISSN: ['2227-9717']
DOI: https://doi.org/10.3390/pr9020330